Accurate Context-Free Parsing with Combinatory Categorial Grammar
نویسندگان
چکیده
The definition of combinatory categorial grammar (CCG) in the literature varies quite a bit from author to author. However, the differences between the definitions are important in terms of the language classes of each CCG. We prove that a wide range of CCGs are strongly context-free, including the CCG of CCGbank and of the parser of Clark and Curran (2007). In light of these new results, we train the PCFG parser of Petrov and Klein (2007) on CCGbank and achieve state of the art results in supertagging accuracy, PARSEVAL measures and dependency accuracy.
منابع مشابه
KUL-Eval: A Combinatory Categorial Grammar Approach for Improving Semantic Parsing of Robot Commands using Spatial Context
When executing commands, a robot has a certain level of contextual knowledge about the environment in which it operates. Taking this knowledge into account can be beneficial to disambiguate commands with multiple interpretations. We present an approach that uses combinatory categorial grammars for improving the semantic parsing of robot commands that takes into account the spatial context of th...
متن کاملParsing Some Constrained Grammar Formalisms
In this paper we present a scheme to extend a recognition algorithm for Context-Free Grammars (CFG) that can be used to derive polynomial-time recognition algorithms for a set of formalisms that generate a superset of languages generated by CFG. We describe the scheme by developing a Cocke-Kasami-Younger (CKY)-like pure bottom-up recognition algorithm for Linear Indexed Grammars and show how it...
متن کاملParsing Linear-Context Free Rewriting Systems with Fast Matrix Multiplication
We describe a recognition algorithm for a subset of binary linear context-free rewriting systems (LCFRS) with running time O(nωd) where M(m) = O(m ) is the running time for m×m matrix multiplication and d is the “contact rank” of the LCFRS—the maximal number of combination and non-combination points that appear in the grammar rules. We also show that this algorithm can be used as a subroutine t...
متن کاملKorean Parsing Based on the Applicative Combinatory Categorial Grammar
The Applicative Combinatory Categorial Grammar (ACCG) is a new approach to Categorial Grammars by using exclusively the Combinatory Logic. This extended categorial grammar that was originally developed by J.-P. Desclés and I. Biskri, allows us to tackle the problem of the Korean language parsing in which there exist many difficulties from a computational point of view. In this paper, we handle ...
متن کاملRoBox: CCG with Structured Perceptron for Supervised Semantic Parsing of Robotic Spatial Commands
We use a Combinatory Categorial Grammar (CCG) parser with a structured perceptron learner to address Shared Task 6 of SemEval-2014, Supervised Semantic Parsing of Robotic Spatial Commands. Our system reaches an accuracy of 79% ignoring spatial context and 87% using the spatial planner, showing that CCG can successfully be applied to the task.
متن کامل